Matrix Completion Problems
نویسنده
چکیده
Matrix completion problems are concerned with determining whether partially speciied matrices can be completed to fully speciied matrices satisfying certain prescribed properties. In this article we survey some results and provide references about these problems for the following matrix properties: positive semideenite matrices, Euclidean distance matrices, completely positive matrices, contraction matrices, and matrices of given rank. We treat mainly optimization and combinatorial aspects.
منابع مشابه
Graph Matrix Completion in Presence of Outliers
Matrix completion problem has gathered a lot of attention in recent years. In the matrix completion problem, the goal is to recover a low-rank matrix from a subset of its entries. The graph matrix completion was introduced based on the fact that the relation between rows (or columns) of a matrix can be modeled as a graph structure. The graph matrix completion problem is formulated by adding the...
متن کاملA Survey on the Matrix Completion Problem
Completion problems arise in a variety of applications, such as statistics (e.g. entropy methods for missing data), chemistry (the molecular conformation problem), systems theory, discrete optimization (relaxation methods), data compression, etc., as well as in operator theory and within matrix theory (e.g. determinantal inequalities). In addition to applications, completion problems have provi...
متن کاملUsing noncommutative Gröbner bases in solving partially prescribed matrix inverse completion problems
We investigate the use of noncommutative Gröbner bases in solving partially prescribed matrix inverse completion problems. The types of problems considered here are similar to those in [BJLW95]. There the authors gave necessary and sufficient conditions for the solution of a two by two block matrix completion problem. Our approach is quite different from theirs and relies on symbolic computer a...
متن کاملComputational Limits for Matrix Completion
Matrix Completion is the problem of recovering an unknown real-valued low-rank matrix from a subsample of its entries. Important recent results show that the problem can be solved efficiently under the assumption that the unknown matrix is incoherent and the subsample is drawn uniformly at random. Are these assumptions necessary? It is well known that Matrix Completion in its full generality is...
متن کاملNo Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis
In this paper we develop a new framework that captures the common landscape underlying the common non-convex low-rank matrix problems including matrix sensing, matrix completion and robust PCA. In particular, we show for all above problems (including asymmetric cases): 1) all local minima are also globally optimal; 2) no highorder saddle points exists. These results explain why simple algorithm...
متن کاملUniqueness of the Solutions of Some Completion Problems
We determine the conditions for uniqueness of the solutions of several completion problems including the positive semi-definite completion, the distance matrix completion, and the contractive matrix completion. The conditions depend on the existence of a positive semi-definite matrix satisfying certain linear constraints. Numerically, such conditions can be checked by existing computer software...
متن کامل